Remarks concerning Finitely Generated Semigroups Having Regular Sets of Unique Normal Forms

Markov semigroups, monoids, and groups

A group is Markov if it admits a prefix-closed regular language of unique representatives with respect to some generating set, and strongly Markov if it admits such a language of unique minimal-length representatives over every generating set. This paper considers the natural generalizations of these concepts to semigroups and monoids. Two distinct potential generalizations to monoids are shown...

Small Overlap Monoids Ii: Automatic Structures and Normal Forms

We show that any finite monoid or semigroup presentation satisfying the small overlap condition C(4) has word problem which is a deterministic rational relation. It follows that the set of lexicographically minimal words forms a regular language of normal forms, and that these normal forms can be computed in linear time. We also deduce that C(4) monoids and semigroups are rational (in the sense...

Rigid Resolution of a Finitely Generated Module Over a Regular Local Ring

Regular ordered semigroups in terms of fuzzy subsets

In this paper we extend some results concerning ideals of left regular and intra-regular ordered semigroups to fuzzy ordered semigroups. A theory of fuzzy sets on ordered groupoids and ordered semigroups can be developed. Some results on ordered groupoidssemigroups have been already given by the same authors. The aim of writing this paper is to show the way we pass from the theory of ordered se...

The word problem for free adequate semigroups

We study the complexity of computation in finitely generated free left, right and two-sided adequate semigroups and monoids. We present polynomial time (quadratic in the RAM model of computation) algorithms to solve the word problem and compute normal forms in each of these, and hence also to test whether any given identity holds in the classes of left, right and/or two-sided adequate semigroups.